\hypertarget{longest__common__subsequence_8h}{}\section{src/dynamic\+\_\+programming\+\_\+algorithms/lcs/longest\+\_\+common\+\_\+subsequence.h File Reference}
\label{longest__common__subsequence_8h}\index{src/dynamic\+\_\+programming\+\_\+algorithms/lcs/longest\+\_\+common\+\_\+subsequence.\+h@{src/dynamic\+\_\+programming\+\_\+algorithms/lcs/longest\+\_\+common\+\_\+subsequence.\+h}}
{\ttfamily \#include $<$type\+\_\+traits$>$}\\*
{\ttfamily \#include $<$vector$>$}\\*
{\ttfamily \#include $<$iostream$>$}\\*
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_dynamic_programming_algorithm}{Introduction\+To\+Algorithm\+::\+Dynamic\+Programming\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_dynamic_programming_algorithm}{Dynamic\+Programming\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Iterator , typename Out\+Iterator $>$ }\\std\+::size\+\_\+t \hyperlink{namespace_introduction_to_algorithm_1_1_dynamic_programming_algorithm_a377ef4206d4814024272c15c51051f09}{Introduction\+To\+Algorithm\+::\+Dynamic\+Programming\+Algorithm\+::make\+\_\+\+L\+C\+S} (const Iterator begin, const Iterator end, const std\+::vector$<$ std\+::vector$<$ int $>$$>$ \&flag\+\_\+matrix, typename std\+::iterator\+\_\+traits$<$ Iterator $>$\+::difference\+\_\+type seq1\+\_\+index, typename std\+::iterator\+\_\+traits$<$ Iterator $>$\+::difference\+\_\+type seq2\+\_\+index, Out\+Iterator \&out\+\_\+begin)
\begin{DoxyCompactList}\small\item\em make\+\_\+\+L\+C\+S 最长公共子序列的子算法：已知标记矩阵，求最长公共子序列 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Iterator1 , typename Iterator2 , typename Out\+Iterator $>$ }\\std\+::size\+\_\+t \hyperlink{namespace_introduction_to_algorithm_1_1_dynamic_programming_algorithm_a02edd40c3c2dd3ce1b514284dd42e99c}{Introduction\+To\+Algorithm\+::\+Dynamic\+Programming\+Algorithm\+::longest\+\_\+common\+\_\+subsequence} (const Iterator1 first\+\_\+begin, const Iterator1 first\+\_\+end, const Iterator2 second\+\_\+begin, const Iterator2 second\+\_\+end, Out\+Iterator out\+\_\+begin)
\begin{DoxyCompactList}\small\item\em longest\+\_\+common\+\_\+subsequence 算法导论第15章9.4 最长公共子序列 \end{DoxyCompactList}\end{DoxyCompactItemize}
